A Graph Theoretical Algorithmic Approach for DNA Sequencing
نویسندگان
چکیده
منابع مشابه
A Graph-Theoretical Model for the Aircraft Sequencing Problem
The main purpose of optimized sequencing of landing/taking-o® operations is to obtain a better exploitation of the existing airport infrastructure, thus improving the performances of the entire ATC system. In this paper we deal with innovative sequencing models for managing arrivals and departures times of the aircrafts at an airport. These models are based on the so-called alternative graph fo...
متن کاملA Graph-Based Clustering Approach to Identify Cell Populations in Single-Cell RNA Sequencing Data
Introduction: The emergence of single-cell RNA-sequencing (scRNA-seq) technology has provided new information about the structure of cells, and provided data with very high resolution of the expression of different genes for each cell at a single time. One of the main uses of scRNA-seq is data clustering based on expressed genes, which sometimes leads to the detection of rare cell populations. ...
متن کاملA Graph-Based Clustering Approach to Identify Cell Populations in Single-Cell RNA Sequencing Data
Introduction: The emergence of single-cell RNA-sequencing (scRNA-seq) technology has provided new information about the structure of cells, and provided data with very high resolution of the expression of different genes for each cell at a single time. One of the main uses of scRNA-seq is data clustering based on expressed genes, which sometimes leads to the detection of rare cell populations. ...
متن کاملDigital metrics: A graph-theoretical approach
Consider the following two graphs M a n d N, both with vertex set Z×Z, where Z is the set of all integers. In M, two vertices are adjacent when their euclidean distance is 1, while in N, adjacency is obtained when the distance is either 1 or 1/2. By definition, H is a metric subgraph of the graph G if the distance between any two points o f / 4 is the same as their distance in G. We determine a...
متن کاملSlicing Concurrent Programs - A Graph-Theoretical Approach
This paper extends the notion of slicing, which was originally proposed and studied for sequential programs, to concurrent programs and presents a graph-theoretical approach to slicing concurrent programs. In addition to the usual control and data dependences proposed and studied for sequential programs, the paper introduces three new types of primary program dependences in concurrent programs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Mathematics
سال: 2013
ISSN: 2319-765X,2278-5728
DOI: 10.9790/5728-0514046